Closed Classes of Functions, Generalized Constraints and Clusters
نویسنده
چکیده
Classes of functions of several variables on arbitrary non-empty domains that are closed under permutation of variables and addition of dummy variables are characterized in terms of generalized constraints, and hereby Hellerstein’s Galois theory of functions and generalized constraints is extended to infinite domains. Furthermore, classes of operations on arbitrary non-empty domains that are closed under permutation of variables, addition of dummy variables and composition are characterized in terms of clusters, and a Galois connection is established between operations and clusters.
منابع مشابه
Decomposition of supra soft locally closed sets and supra SLC-continuity
In this paper, we introduce two different notions of generalized supra soft sets namely supra A--soft sets and supra soft locally closed sets in supra soft topological spaces, which are weak forms of supra open soft sets and discuss their relationships with each other and other supra open soft sets [{it International Journal of Mathematical Trends and Technology} (IJMTT), (2014) Vol. 9 (1):37--...
متن کاملSoft regular generalized b-closed sets in soft topological spaces
The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...
متن کاملOn weakly e*-open and weakly e*-closed Functions
The aim of this paper is to introduce and study two new classes of functions called weakly $e^{*}$-open functions and weakly $e^{*}$-closed functions via the concept of $e^{*}$-open set defined by Ekici cite{erd1}. The notions of weakly $e^{*}$-open and weakly $e^{*}$-closed functions are weaker than the notions of weakly $beta$-open and weakly $beta$-closed functions defined by Caldas and Nava...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملAutoconvolution equations and generalized Mittag-Leffler functions
This article is devoted to study of the autoconvolution equations and generalized Mittag-Leffler functions. These types of equations are given in terms of the Laplace transform convolution of a function with itself. We state new classes of the autoconvolution equations of the first kind and show that the generalized Mittag-Leffler functions are solutions of these types of equations. In view of ...
متن کامل